Parametric Gamut Mapping Algorithms Using Variable Anchor Points

نویسندگان

  • Chae-Soo Lee
  • Cheol-Hee Lee
  • Yeong-Ho Ha
چکیده

In this article, a new gamut-mapping algorithm (GMA) that utilizes variable anchor points (center of gravity on the lightness axis) is proposed. The proposed algorithm increases lightness range, which is reduced from conventional gamut mapping toward an anchor point. In this process, this algorithm utilizes multiple anchor points with constant slopes to both reduce a sudden color change on the gamut boundary of the printer and to maintain a uniform color change during the mapping process. Accordingly, the proposed algorithm can reproduce high quality images with low-cost color devices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gamut Mapping Algorithm Using Lightness Mapping and Multiple Anchor Points for Linear Tone and Maximum Chroma Reproduction

of the reproduction’s. Therefore, if the lightness values of the maximum chroma in the two gamuts are not located at the center of the lightness axis of the two media, the parametric GMA will produce a different color change in the bright and dark regions. In this condition, if linear compression or soft-clipping compression is applied to the lightness mapping, the lightness value difference be...

متن کامل

A Color Gamut Description Algorithm for Liquid Crystal Displays in CIELAB Space

Because the accuracy of gamut boundary description is significant for gamut mapping process, a gamut boundary calculating method for LCD monitors is proposed in this paper. Within most of the previous gamut boundary calculation algorithms, the gamut boundary is calculated in CIELAB space directly, and part of inside-gamut points are mistaken for the boundary points. While, in the new proposed a...

متن کامل

A New Method for Color Gamut Mapping by Genetic Algorithm

To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...

متن کامل

Image-dependent three-dimensional gamut mapping using gamut boundary descriptor

A 3-D image-to-device gamut mapping algorithm (I-D GMA) is an ideal way to map display image to the inside of printer gamut. A quick decision whether or not each pixel is located inside of the device gamut is necessary to execute a 3-D I-D GMA. We propose a new gamut boundary descriptor (GBD) for comparing the gamut between image and device by the discrete polar angle (Du,Dw). The gamut shell i...

متن کامل

Psychophysical evaluation of gamut mapping techniques using simple rendered images and artificial gamut boundaries

Using a paired comparison paradigm, various gamut mapping algorithms were evaluated using simple rendered images and artificial gamut boundaries. The test images consisted of simple rendered spheres floating in front of a gray background. Using CIELAB as our device-independent color space, cut-off values for lightness and chroma, based on the statistics of the images, were chosen to reduce the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000